Cross-Training with Imperfect Training Schemes
نویسندگان
چکیده
منابع مشابه
Context Training Training Cross Testing
Table 3: Results of comparing hidden layer sizes (6-context). Training was done on 573 items, using a cross validation set of 258 items. and perhaps even to other markup recognition problems , and (iv) compare the use of the neural net with more conventional tools such as decision trees and Hidden Markov Models. for assistance in nding references and determining the status of related work. Spec...
متن کاملMultiple-cluster adaptive training schemes
This paper examines the training of multiple-cluster systems using adaptive training schemes. Various forms of transformation and canonical model are described in a consistent framework allowing re-estimation formulae for all cases to be simply derived. Initial experiments using these various schemes on a large vocabulary speech recognition task are presented. The initial experiments indicate t...
متن کاملReceive Antenna Selection with Imperfect Channel Knowledge From Training
Receive antenna selection (AS), in which a subset of a receiver’s antennas, is selected based on the instantaneous channel condition, enables the receiver to benefit from having multiple antenna elements despite using significantly less hardware. However, the limited hardware resources also impose unique constraints on how channel state information, which is necessary to select the antennas and...
متن کاملCross-gradient Training
We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using techniques like domain adversarial training. In contrast, CROSSGRAD is free to use dom...
متن کاملBreaking SVM Complexity with Cross-Training
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure aims at creating a separable distribution of training examples with minimal impact on the position of the decision boundary. It breaks the linear dependency between the number of SVs and the number of training examples...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Production and Operations Management
سال: 2016
ISSN: 1059-1478
DOI: 10.1111/poms.12543